Parallelism for quantum computation with qudits
نویسندگان
چکیده
منابع مشابه
Parallelism for Quantum Computation with Qudits
Dianne P. O’Leary1,3,∗ Gavin K. Brennen2,† and Stephen S. Bullock3‡ 1 University of Maryland, Department of Computer Science and Institute for Advanced Computer Studies, College Park, Maryland 20742 and National Institute of Standards and Technology, Mathematical and Computational Sciences Division, Gaithersburg, MD 20899 USA 2 Institute for Quantum Optics and Quantum Information of the Austria...
متن کاملGeometry of Quantum Computation with Qudits
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry...
متن کاملMolecular spin qudits for quantum algorithms.
Presently, one of the most ambitious technological goals is the development of devices working under the laws of quantum mechanics. One prominent target is the quantum computer, which would allow the processing of information at quantum level for purposes not achievable with even the most powerful computer resources. The large-scale implementation of quantum information would be a game changer ...
متن کاملTransmitting qudits through larger quantum channels
By a quantum channel is intended [1, 2] a completely positive and trace-precerving linear map Φ : σ(H) → σ(H), where σ(H) is a set of states in a Hilbert space H with dimH = n ≤ +∞. Even for a finite dimension n < +∞ there is a number of difficult problems concerning the construction of optimal transmission of the information through a quantum channel. The infinite dimensional case we are espec...
متن کاملGeneralized Quantum Search with Parallelism
We generalize Grover’s unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover’s algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2006
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.74.032334